An algorithm for the asynchronous Write-All problem based on process collision
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولTransformations for Write-All-with-Collision Model
Dependable properties such as self-stabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed systems where such self-stabilizing algorithms have been designed. Since these existing algorithms are designed in read/write model (or variations thereof), they cannot be directly applied in sensor networks. For this ...
متن کاملAlgorithms for the Certified Write-All Problem
In this paper, we prove new upper bounds on the complexity of the certified write-all problem with respect to an adaptive adversary. Our strongest result is that for any ǫ > 0, there exists an O(p) work algorithm for the p-processor p-memory cell write-all. We also give a randomized O(p log p) work algorithm for a p-processor p-memory cell write-all.
متن کاملAlgorithms for the Certiied Write All Problem
In this paper, we prove new upper bounds on the complexity of the Certiied Write All Problem with respect to an adaptive adversary. Our strongest result is that for any > 0, there exists an O(p 1+) work algorithm for the p processor, p memory cell write all. We also give a randomize O(p 2 log p) work algorithm for a p processor p 2 memory cell write all.
متن کاملA Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
In their SIAM J. on Computing paper [33] from 1992, Martel et al. posed a question for developing a work-optimal deterministic asynchronous algorithm for the fundamental loadbalancing and synchronization problem called Certified Write-All. In this problem, introduced in a slightly different form by Kanellakis and Shvartsman in a PODC’89 paper [20], p processors must update nmemory cells and onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2001
ISSN: 0178-2770
DOI: 10.1007/pl00008930